منابع مشابه
A top down algorithm for constrained tree inclusion
An ordered labeled tree is a tree which nodes are labeled and in which the left-to-right order among siblings is significant. Given two ordered labeled trees P and T , the constrained tree inclusion problem is to determine whether it is possible to obtain P from T by deleting degree-one or degreetwo nodes. G. Valiente proposed a bottom up algorithm which solves the problem in O(|P ||T |) time a...
متن کاملTree Inclusion Checking Revisited
In this paper, we discuss an efficient algorithm for the ordered tree inclusion problem, by which it is checked whether a pattern tree (forest) P can be embedded in a target tree (forest) T. The time complexity of this algorithm is bounded by O(|T|logDP), where DP is the depth of P; and its space overhead is bounded by O(|T| + |P|). This computational complexity is better than any existing alg...
متن کاملTree inclusion problems
Given two trees (a target T and a pattern P ) and a natural number w, window embedded subtree problems consist in deciding whether P occurs as an embedded subtree of T and/or finding the number of size (at most) w windows of T which contain pattern P as an embedded subtree. P is an embedded subtree of T if P can be obtained by deleting some nodes from T (if a node v is deleted, all edges adjace...
متن کاملA new tree inclusion algorithm
We consider the following tree-matching problem: Given labeled, ordered trees P and T , can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v and, if v has a parent u, replacing the edges from u to v by edges from u to the children of v. The existing algorithm for this problem needs O(|T || leaves(P )|) time and O(| leaves(P )|min{DT , | leaves(T...
متن کاملConstrained Tree Editing
The distance between two ordered labeled trees is considered to be the minimum sum of the weights associated with the edit operations (insertion, deletion, and substitution) required to transform one tree to another. The problem of computing this distance and the optimal transformation using no edit constraints has been studied in the literature [3,4,7-9, 111. In this paper, we consider the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2005
ISSN: 1570-8667
DOI: 10.1016/j.jda.2004.08.017